The g-Good-Neighbor Conditional Diagnosability of Exchanged Crossed Cube under the MM* Model

نویسندگان

چکیده

Diagnosability plays an important role in appraising the reliability and fault tolerance of symmetrical multiprocessor systems. The novel g-good-neighbor conditional diagnosability restrains that every fault-free node contains at least g neighbors is suitable for large scale systems, attracting a lot research attention. relationships between connectivity graphs under MM* model are separately studied, but only applicable regular or just ranges rather than exact values. As promising network structure, 2019, Guo et al. obtained exchanged crossed cube (ECQ(s,t)) PMC 2g(s+2−g)−1 (t≥s>g). We noticed value ECQ(s,t) still to be determined. In this paper, by proving upper lower bounds ECQ(s,t), first time, we derive its tgm(ECQ(s,t))=2g(s+2−g)−1 (t≥s>g), achieving unity ECQ(s, t) both model. Towards end, simulation experiments conducted evaluate correctness effectiveness our conclusion. Our provides supplement ECQ(s,t).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The g-Good-Neighbor Conditional Diagnosability of Locally Twisted Cubes

In the work of Peng et al. in 2012, a new measure was proposed for fault diagnosis of systems: namely, g-good-neighbor conditional diagnosability, which requires that any faultfree vertex has at least g fault-free neighbors in the system. In this paper, we establish the g-good-neighbor conditional diagnosability of locally twisted cubes under the PMC model and the MM∗ model.

متن کامل

The Tightly Super 2-good-neighbor connectivity and 2-good-neighbor Diagnosability of Crossed Cubes

Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks (networks for short) as underlying topologies and a network is usually represented by a graph where nodes represent processors and links represent communication links between processors. The network determines the pe...

متن کامل

Some Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System

Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which rest...

متن کامل

Conditional diagnosability of hypercubes under the comparison diagnosis model

Processor fault diagnosis plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. Lai et al. proposed a novel measure of diagnosability, called conditional diagnosability, by adding an additional condition that any faulty set cannot contain all the neighbors of any vertex in a system. We make a contribution ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2022

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym14112376